Weighted iterated local branching for mathematical programming problems with binary variables
نویسندگان
چکیده
Abstract Local search algorithms are frequently used to handle complex optimization problems involving binary decision variables. One way of implementing a local procedure is by using mixed-integer programming solver explore neighborhood defined through constraint that limits the number variables whose values allowed change in given iteration. Recognizing not all equally promising when searching for better neighboring solutions, we propose weighted iterated branching heuristic. This new differs from similar existing methods since it considers groups and associates with each group limit on can change. The weights indicate expected contribution flipping trying identify improving solutions current neighborhood. When fails an solution iteration, proposed heuristic may force into regions space utilizing least flip. tested benchmark instances optimum satisfiability problem, computational results show method superior alternative without weights.
منابع مشابه
Binary Cut-and- Branch Method for Solving Linear Programming Problems with Boolean Variables
A numerical method is proposed for solving linear programming problems with Boolean variables. The method is based on an iterative application of a cutting-plane procedure that takes into account, as fully as possible, the properties of the problems being solved. Heuristic procedures are applied for the synthesis of cutting-planes as an intermediate step substantiating the construction of a sol...
متن کاملA Mathematical Programming Model for Flow Shop Scheduling Problems for Considering Just in Time Production
In this paper, we consider a flow shop scheduling problem with bypass consideration for minimizing the sum of earliness and tardiness costs. We propose a new mathematical modeling to formulate this problem. There are several constraints which are involved in our modeling such as the due date of jobs, the job ready times, the earliness and the tardiness cost of jobs, and so on. We apply adapte...
متن کاملGenetic Programming with Statically Scoped Local Variables
This paper presents an extension to genetic programming to allow the evolution of programs containing local variables with static scope which obey the invariant that all variables are bound at time of use. An algorithm is presented for generating trees which obey this invariant, and an extension to the crossover operator is presented which preserves it. New genetic operators are described which...
متن کاملAn algorithm for nonlinear optimization problems with binary variables
One of the challenging optimization problems is determining the minimizer of a nonlinear programming problem that has binary variables. A vexing difficulty is the rate the work to solve such problems increases as the number of discrete variables increases. Any such problem with bounded discrete variables, especially binary variables, may be transformed to that of finding a global optimum of a p...
متن کاملa method for solving possibilistic multi-objective linear programming problems with fuzzy decision variables
[naeini1] in this paper, a new method is proposed to find the fuzzy optimal solution of fuzzy multi-objective linear programming problems (fmolpp) with fuzzy right hand side and fuzzy decision variables. due to the imprecise nature of available resources, determination of a definitive solution to the model seems impossible. therefore, the proposed model is designed in order to make fuzzy decisi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Heuristics
سال: 2022
ISSN: ['1572-9397', '1381-1231']
DOI: https://doi.org/10.1007/s10732-022-09496-2